New Wormhole Routing Algorithms for Multicomputers
نویسندگان
چکیده
Development of wormhole routing tech niques so far has been largely independent of the re sults available for store and forward routing in litera ture In this paper we provide a general result which enables us to design deadlock free wormhole routing algorithms from store and forward routing algorithms that satisfy certain criteria We illustrate this re sult by developing fully adaptive deadlock free worm hole routing algorithms from two well known store and forward algorithms the positive and negative hop algorithms based on the number of hops taken by messages We compare the negative hop algorithm with the commonly used non adaptive e cube and re cently proposed partially adaptive north last algorithm
منابع مشابه
Adaptive Multicast Wormhole Routing in 2d Mesh Multicomputers Adaptive Multicast Wormhole Routing in 2d Mesh Multicomputers
The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal fully-adaptive, and nonminimal adaptive routing. All the algorithms, which are the rst deadlock-free adaptive multicast wormhole routing algorithms ever proposed, are show...
متن کاملDeadlock-free Multicast Wormhole Routing in Multicomputer Networks Deadlock-free Multicast Wormhole Routing in Multicomputer Networks
EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2...
متن کاملDeadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers
Multicast communication services, in which the same message is delivered from a source node to an arbitrary number of destination nodes, are being provided in new generation multicomputers. Broadcast is a special case of multicast in which a message is delivered to all nodes in the network. The nCUBE-2, a wormhole-routed hyper-cube multicomputer, provides hardware support for broadcast and a re...
متن کاملAdaptive Multicast Wormhole Routing in 2D Mesh Multicomputers
We study the issues of adaptive multicast wormhole routing in 2D mesh multicomputers. Three adaptive multicast wormhole routing strategies are proposed and studied, which include minimal partial adap-tive, minimal fully adaptive and nonminimal multicast routing methods. All the algorithms are shown to be deadlock-free. These are the rst deadlock-free adaptive multicast wormhole routing algorith...
متن کاملResource Deadlocks and Performance of Wormhole Multicast Routing Algorithms
We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing. This type of resource deadlocks has not been addressed in many previously proposed wormhole multicast algorithms. We also show that deadlocks on consumption channels can be avoided by using multiple classes of consumption channels and restricting the use of consumption cha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993